Applied Pohlig-Hellman algorithm in three-pass protocol communication
نویسندگان
چکیده
منابع مشابه
Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem efficiently if the group order is known and has no large prime factors. The consequence is that such groups are avoided. In the past, there have been proposals for cryptography based on cyclic infrastructures. We will show that the Pohlig-Hellman method can be adapted to certai...
متن کاملA Three-Pass Establishment Protocol for Real-Time Multiparty Communication
The development of high-speed networks and global internetworking protocols enable new, multimedia-oriented, applications to emerge, such as teleconferencing and other collaborative applications, or video-on-demand. These new applications rely on the underlying communication infrastructure to be able to provide Quality of Service (QoS) guarantees, typically in form of delay and jitter bounds. A...
متن کاملThe Pohlig-Hellman Method Generalized for Group Structure Computation
We present a new algorithm that extends the techniques of the Pohlig-Hellman algorithm for discrete logarithm computation to the following situation: Given a nite abelian group and group elements h, g1; : : : ; g l , compute the least positive integer y and numbers x1 ; : : : ; x l such that h y = Q gi x i. This computational problem is important for computing the structure of a nite abelian gr...
متن کاملA Secure Wireless Communication Protocol using Diffie - Hellman Key Exchange
In 1976, Diffie and Hellman in their path breaking paper [5] proposed a two party key agreement protocol based on finite field. Diffie – Hellman Key Exchange Protocol [DH protocol] has unique importance in two party wireless communication scenarios. After this protocol several protocols have been proposed bases on DH protocol but the Man in the middle attack raises a serious security concern on...
متن کاملDeniable Authentication Protocol based on Bilinear Diffie - Hellman Algorithm
This paper describes a new deniable authentication protocol whose security is based Diffe-Hellman (CDH) Problem of type Decisional Diffie-Hellman(DDH) and the Hash DiffieHellman (HDDH) problem.This protocol can be implemented in low power and small processor mobile devices such as smart card, PDA etc which work in low power and small processor. A deniable authentication protocol enables a recei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Engineering Science
سال: 2018
ISSN: 1451-4117,1821-3197
DOI: 10.5937/jaes16-16557